A canonical form for generalized linear constraints
نویسندگان
چکیده
منابع مشابه
Computation of a canonical form for linear differential-algebraic equations
This paper describes how a commonly used canonical form for linear differential-algebraic equations can be computed using numerical software from the linear algebra package LAPACK. This makes it possible to automate for example observer construction and parameter estimation in linear models generated by a modeling language like Modelica.
متن کاملCounting Equivalent Linear Finite Transducers Using a Canonical Form
The notion of linear finite transducer (LFT) plays a crucial role in a family of cryptosystems introduced in the 80’s and 90’s. However, as far as we know, no study was ever conducted to count and enumerate these transducers, which is essential to verify if the size of the key space, of the aforementioned systems, is large enough to prevent an exhaustive search attack. In this paper, we determi...
متن کاملGeneralized Nonlinear Output-Feedback Canonical Form: Global Output Tracking
A global robust output feedback dynamic compensator is proposed for stabilization and tracking of a class of systems that are globally di eomorphic into systems which are in generalized output-feedback canonical form. This form includes as special cases the standard outputfeedback canonical form and various other forms considered previously in the literature. Output-dependent nonlinearities are...
متن کاملHyperbolic-type Generalized Lorenz Chaotic System and Its Canonical Form
Abstract: This paper shows that a large class of chaotic systems, introduced in (Čelikovský and Vaněček, 1994), (Vaněček and Čelikovský, 1996) as the generalized Lorenz system, can be further generalized to the hyperbolic-type generalized Lorenz system. While the generalized Lorenz system unifies both the famous Lorenz system and new Chen’s system (Ueta and Chen, 1999), (Chen and Ueta, 2000), t...
متن کاملEfficient computation of a canonical form for a matrix with the generalized P-property
We use recent results on algorithms for Markov decision problems to show that a canonical form for a matrix with the generalized P-property can be computed, in some important cases, by a strongly polynomial algorithm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1992
ISSN: 0747-7171
DOI: 10.1016/0747-7171(92)90002-l